1312A - Two Regular Polygons - CodeForces Solution


geometry greedy math number theory *800

Please click on ads to support us..

Python Code:

n=int(input())
for i in range(n):
    a,b=map(int,input().split())
    if(a%b==0):
        print("YES")
    else:
        print("NO")
			  				    	 		  						 	 	 	

C++ Code:

#include <bits/stdc++.h>
using namespace std;
int m,n,t;
int main(){
	cin>>t;
	while(t--){	
		cin>>n>>m;
		cout<<(n%m?"NO":"YES")<<endl;
	}
	return 0;
}


Comments

Submit
0 Comments
More Questions

1506A - Strange Table
456A - Laptops
855B - Marvolo Gaunt's Ring
1454A - Special Permutation
1359A - Berland Poker
459A - Pashmak and Garden
1327B - Princesses and Princes
1450F - The Struggling Contestant
1399B - Gifts Fixing
1138A - Sushi for Two
982C - Cut 'em all
931A - Friends Meeting
1594A - Consecutive Sum Riddle
1466A - Bovine Dilemma
454A - Little Pony and Crystal Mine
2A - Winner
1622B - Berland Music
1139B - Chocolates
1371A - Magical Sticks
1253A - Single Push
706B - Interesting drink
1265A - Beautiful String
214A - System of Equations
287A - IQ Test
1108A - Two distinct points
1064A - Make a triangle
1245C - Constanze's Machine
1005A - Tanya and Stairways
1663F - In Every Generation
1108B - Divisors of Two Integers